Fast Group Communication Scheduling in Duty-Cycled Multihop Wireless Sensor Networks
نویسندگان
چکیده
We study group communication scheduling in duty-cycled multi-hop wireless sensor networks. Assume that time is divided into time-slots and we group multiple consecutive time-slots into periods. Each node can transmit data at any time-slot while it only wakes up at its active time-slot of every period and thus be allowed to receive data. Under the protocol interference model, we investigate four group communication patterns, i.e., broadcast, data aggregation, data gathering, and gossiping. For each pattern, we develop a delay efficient scheduling algorithm which greatly improve the current state-of-the-art algorithm. Additionally, we propose a novel and efficient design to coherently couple the wireless interference requirement and duty cycle requirement.
منابع مشابه
A JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملDuty-Cycled Wireless Sensor Networks: Wakeup Scheduling, Routing, and Broadcasting
(ABSTRACT) In order to save energy consumption in idle states, low duty-cycled operation is widely used in Wireless Sensor Networks (WSNs), where each node periodically switches between sleeping mode and awake mode. Although efficient toward saving energy, duty-cycling causes many challenges , such as difficulty in neighbor discovery due to asynchronous wakeup/sleep scheduling, time-varying tra...
متن کاملGeo Routing in Duty-cycled Mobile Sensor Networks Using Sleep Scheduling Algorithm
In this paper focus on sleep scheduling for geographic routing in duty cycled WSNs with mobile sensors and proposes two geographic-distance-based connected-k neighbourhood (GCKN) sleep scheduling algorithms. The first one is the geographic-distance-based connected-k neighbourhood for first path (GCKNF) sleep scheduling algorithm. The second one is the geographic-distance-based connected-k neigh...
متن کاملStair Scheduling for Data Collection in Wireless Sensor Networks
Spatially organized clusters are basic structure for large-scale wireless sensor networks. A cluster is generally composed by a large amount of energy-limited low-tier nodes (LNs), which are managed by a powerful cluster head (CH). The low-tier nodes that are close to the cluster head generally become bottlenecks in data collection applications. Energy efficient scheduling is important for the ...
متن کاملOn Multihop Broadcast over Adaptively Duty-Cycled Wireless Sensor Networks
We consider the problem of multihop broadcast over adaptively duty-cycled wireless sensor networks (WSNs) where neighborhood nodes are not simultaneously awake. We present Hybrid-cast, an asynchronous and multihop broadcasting protocol, which can be applied to low duty-cycling or quorum-based duty-cycling schedule where nodes send out a beacon message at the beginning of wakeup slots. Hybridcas...
متن کامل